An Exploration of Stochastic Completion Fields
نویسنده
چکیده
We present in this paper a method originally proposed by Williams and Jacobs to determine the shape of illusory contours. The theory on stochastic completion fields is based on the assumption that the prior probability distribution of completion shapes can be modelled by the random walks of particles. Two different algorithms to compute completion fields are presented. The first is based on the convolution of a large kernel determined by MonteCarlo simulation and the other on the integration of the Fokker-Planck equation by repeated convolutions of small kernels. Experimental results are then presented to demonstrate the effectiveness of stochastic completion fields. We conclude with a discussion that suggests when the use of completion fields may fail.
منابع مشابه
Fuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملIntegrated Well Placement and Completion Optimization using Heuristic Algorithms: A Case Study of an Iranian Carbonate Formation
Determination of optimum location for drilling a new well not only requires engineering judgments but also consumes excessive computational time. Additionally, availability of many physical constraints such as the well length, trajectory, and completion type and the numerous affecting parameters including, well type, well numbers, well-control variables prompt that the optimization approaches b...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کامل